Explicit Substitutions Calculi with Explicit Eta Rules
نویسنده
چکیده
It has been argued that the notion of substitution in the λ-calculus needs to be made explicit and many calculi have been developed in which the computational steps of the substitution operation involved in β-contractions have been atomised. In contrast to the great variety of developments for making explicit formalisations of the Beta rule, less work has been done for giving explicit definitions of the conditional Eta rule. In this paper constructive Eta rules are proposed for both the λσand the λse-calculi of explicit substitutions. Our results can be summarised as follows: 1) we introduce constructive and explicit definitions of the Eta rule in the λσand the λse-calculi, 2) we prove that these definitions are correct and preserve basic properties such as subject reduction. In particular, we show that the explicit definitions of the eta rules coincide with the Eta rule for pure λ-terms and that moreover, their application is decidable in the sense that Eta redexes are effectively detected (and contracted). The formalisation of these Eta rules involves the development of specific calculi for explicitly checking the condition of the proposed Eta rules while constructing the Eta contractum.
منابع مشابه
Explicit substitutions calculi with one step Eta-reduction decided explicitly
It has long been argued that the notion of substitution in the λ-calculus needs to be made explicit. This resulted in many calculi have been developed in which the computational steps of the substitution operation involved in β-contractions have been atomised. In contrast to the great variety of developments for making explicit formalisations of the Beta rule, less work has been done for giving...
متن کاملComparing and implementing calculi of explicit substitutions with eta-reduction
The past decade has seen an explosion of work on calculi of explicit substitutions. Numerous work has illustrated the usefulness of these calculi for practical notions like the implementation of typed functional programming languages and higher order proof assistants. It has also been shown that eta-reduction is useful for adapting substitution calculi for practical problems like higher order u...
متن کاملAn explicit Eta rewrite rule Daniel BRIAUD N ̊ 2417
In this report, we extend-calculi of explicit substitutions by an Eta rule. We do this in the framework of , a-calculus of explicit substitutions introduced by Lescanne (1994) and thoroughly studied by Lescanne and Rouyer-Degli (1994). The main feature of such a calculus is that the classical-contraction is expressed by a rst-order term rewriting system. Our main result is the explicitation of ...
متن کاملComparing Calculi of Explicit Substitutions with Eta-reduction
The past decade has seen an explosion of work on calculi of explicit substitutions. Numerous work has illustrated the usefulness of these calculi for practical notions like the implementation of typed functional programming languages and higher order proof assistants. Three styles of explicit substitutions are treated in this paper: the λσ and the λse which have proved useful for solving practi...
متن کاملCut Rules and Explicit Substitutions RENÉ
We introduce a method to associate calculi of proof terms and rewrite rules with cut elimination procedures for logical deduction systems (i.e., Gentzen-style sequent calculi) in the case of intuitionistic logic. We illustrate this method using two different versions of the cut rule for a variant of the intuitionistic fragment of Kleene's logical deduction system G3. Our systems are in fact cal...
متن کامل